Simulation of MPI applications with time-independent traces
نویسندگان
چکیده
منابع مشابه
Simulation of MPI applications with time-independent traces
Analyzing and understanding the performance behavior of parallel applications on parallel computing platforms is a long-standing concern in the High Performance Computing community. When the targeted platforms are not available, simulation is a reasonable approach to obtain objective performance indicators and explore various hypothetical scenarios. In the context of applications implemented wi...
متن کاملSimulation of a Neutron Detector for Real Time Imaging Applications
Monte Carlo Method is used to simulate a double layer gadolinium-amorphous silicon thermal neutron detector. The detector fabricated in pixel array configuration has various applications including neutron imaging. According to the simulation results, a detector consisting of a gadolinium (Gd) film with thickness of 2-4 ~m, sandwiched properly with two layers of sufficiently thick (-30 ?µm) hydr...
متن کاملTowards Real-Time Aircraft Simulation with the MPI Motion Simulator
The paper describes the recent advancements gained on the MPI motion simulator project. The aim of this project is the use of an anthropomorphic robot as actuation system for a motion platform intended for real time flight simulation. Almost all commercially available motion platforms rely on the so called Stewart platform, that is a 6-DOF platform that can bear high payloads and can achieve hi...
متن کاملToward Better Simulation of MPI Applications on Ethernet/TCP Networks
Simulation and modeling for performance prediction and profiling is essential for developing and maintaining HPC code that is expected to scale for next-generation exascale systems, and correctly modeling network behavior is essential for creating realistic simulations. In this article we describe an implementation of a flow-based hybrid network model that accounts for factors such as network t...
متن کاملDiscriminating Traces with Time
What properties about the internals of a program explain the possible di↵erences in its overall running time for di↵erent inputs? In this paper, we propose a formal framework for considering this question we dub trace-set discrimination. We show that even though the algorithmic problem of computing maximum likelihood discriminants is NP-hard, approaches based on integer linear programming (ILP)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2014
ISSN: 1532-0626
DOI: 10.1002/cpe.3278